Lucas’ test for Mersenne numbers, $6000<p<7000$
نویسندگان
چکیده
منابع مشابه
Generalised Mersenne Numbers Revisited
Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attractive choice for modular multiplication implementation. However, the issue of residue multiplication efficiency seems to have been overlooked....
متن کاملMersenne and Fermat Numbers
The first seventeen even perfect numbers are therefore obtained by substituting these values of ra in the expression 2n_1(2n —1). The first twelve of the Mersenne primes have been known since 1914; the twelfth, 2127 —1, was indeed found by Lucas as early as 1876, and for the next seventy-five years was the largest known prime. More details on the history of the Mersenne numbers may be found in ...
متن کاملCongruences for q-Lucas Numbers
For α, β, γ, δ ∈ Z and ν = (α, β, γ, δ), the q-Fibonacci numbers are given by F ν 0 (q) = 0, F ν 1 (q) = 1 and F ν n+1(q) = q αn−βF ν n (q) + q γn−δF ν n−1(q) for n > 1. And define the q-Lucas number Ln(q) = F ν n+1(q)+ q γ−δF ν∗ n−1(q), where ν∗ = (α, β− α, γ, δ − γ). Suppose that α = 0 and γ is prime to n, or α = γ is prime to n. We prove that Ln(q) ≡ (−1) (mod Φn(q)) for n > 3, where Φn(q) i...
متن کاملLucas-sierpiński and Lucas-riesel Numbers
In this paper, we show that there are infinitely many Sierpiński numbers in the sequence of Lucas numbers. We also show that there are infinitely many Riesel numbers in the sequence of Lucas numbers. Finally, we show that there are infinitely many Lucas numbers that are not a sum of two prime powers.
متن کاملOn Lucas-bernoulli Numbers
In this article we investigate the Bernoulli numbers B̂n associated to the formal group laws whose canonical invariant differentials generate the Lucas sequences {Un} and {Vn}. We give explicit expressions for these numbers and prove analogues of Kummer congruences for them.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1964
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1964-0157924-9